Injecting problem-dependent knowledge to improve evolutionary optimization search ability
نویسندگان
چکیده
منابع مشابه
Injecting problem-dependent knowledge to improve evolutionary optimization search ability
The flexibility introduced by evolutionary algorithms (EAs) has allowed the use of virtually any objective function, even when evaluations require, as in typical real-world problems, running complex mathematical and/or procedural simulations of the systems under analysis. The literature is very extensive in examples in all the fields of engineering and science, and more specifically in the wate...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کاملResilient Individuals Improve Evolutionary Search
Results from the artificial life community show that under some conditions evolving populations converge on broader, but less fit peaks in the fitness landscape and avoid more fit, but narrower peaks. Results from the evolutionary computation community show that over time genotypes evolve to become more resilient, where resiliency (or genetic robustness) is defined as the ability of an individu...
متن کاملUsing Prediction to Improve Combinatorial Optimization Search
This paper describes a statistical approach to improving the performance of stochastic search algorithms for optimization. Given a search algorithmA, we learn to predict the outcome of A as a function of state features along a search trajectory. Predictions are made by a function approximator such as global or locally-weighted polynomial regression; training data is collected by Monte-Carlo sim...
متن کاملProblem dependent optimization (PDO)
A metaheuristic is generally a procedure designed to find a good solution to a difficult optimization problem. Known optimization search metaheuristics heavily rely on parameters, which are usually introduced so that the metaheuristic follows some supposedly related to the optimization problem natural process (simulated annealing, swarm optimization, genetic algorithms). Adjusting the parameter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computational and Applied Mathematics
سال: 2016
ISSN: 0377-0427
DOI: 10.1016/j.cam.2015.03.019